Efficient and Optimal Selling Mechanisms with Private Information Acquisition Costs∗

نویسندگان

  • Jingfeng Lu
  • Lixin Ye
چکیده

In auctions with private information acquisition costs, we completely characterize efficient and optimal two-stage selling mechanisms, with the first stage being the pre-screening or entry right allocation mechanism, and the second stage being the traditional private good provision mechanism. Both efficiency and optimality require the second stage mechanism to be ex post efficient. For the first stage of entry allocation, both efficient and optimal mechanisms admit the most efficient bidders (the bidders with the least information acquisition costs), while the optimal mechanism admits fewer entrants. The efficient entry right allocation rule maximizes the expected total surplus, while the optimal entry right allocation rule maximizes the expected “virtual” total surplus, which is the total surplus adjusted for the information rent. We show that both efficient and optimal entry right allocation rules can be truthfully implemented in dominant strategies. We also demonstrate that the optimal entry right allocation mechanism can be implemented through an all-pay auction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient and optimal mechanisms with private information acquisition costs

In auctions with private information acquisition costs, we completely characterize (socially) efficient and (revenue) optimal two-stage mechanisms, with the first stage being an entry right allocation mechanism and the second stage being a traditional private good provision mechanism. Both efficiency and revenue optimality require that the second-stage selling mechanism be ex post efficient and...

متن کامل

Optimal Mechanisms for Single Machine Scheduling

We study the design of optimal mechanisms in a setting where job-agents compete for being processed by a service provider that can handle one job at a time. Each job has a processing time and incurs a waiting cost. Jobs need to be compensated for waiting. We consider two models, one where only the waiting costs of jobs are private information (1-d), and another where both waiting costs and proc...

متن کامل

Optimal Selling Scheme for Heterogeneous Consumers with Uncertain Valuations

In this paper, we investigate the optimal selling scheme for a capacity-constrained seller who faces both aggregate demand and individual valuation uncertainties. As each consumer privately observes an initial estimate prior to the transactions and an updated information post-purchase, the problem exhibits the sequential screening feature and return policy emerges as part of the optimal selling...

متن کامل

When Acquisition Spoils Retention: Direct Selling vs. Delegation Under CRM

T widespread implementation of customer relationship management technologies in business has allowed companies to increasingly focus on both acquiring and retaining customers. The challenge of designing incentive mechanisms that simultaneously focus on customer acquisition and customer retention comes from the fact that customer acquisition and customer retention are usually separate but intert...

متن کامل

INFORMATION ACQUISITION AND EFFICIENT MECHANISM DESIGN BY DIRK BERGEMANN and JUUSO VÄLIMÄKI COWLES FOUNDATION PAPER NO. 1038 COWLES FOUNDATION FOR RESEARCH IN ECONOMICS

1 We consider a general mechanism design setting where each agent can acquire (covert) information before participating in the mechanism. The central question is whether a mechanism exists that provides the efficient incentives for information acquisition ex-ante and implements the efficient allocation conditional on the private information ex-post. It is shown that in every private value envir...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010